On runlength codes
نویسندگان
چکیده
-Several new results on binary ( d , k ) codes are given. First, a new derivation for the capacity of these codes based upon information theoretic principles is given. Based upon this result the spectrum of a ( d , k ) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the ( d , k ) constraint is considered. Lower bounds on the capacity of such a channel are derived.
منابع مشابه
An enumerative method for runlength-limited codes: permutation codes
Permutation codes, introduced by Slepian, were shown to perform well on an additive white Gaussian noise (AWGN) channel. Unfortunately, these codes required large lookup tables, making them quite complex to implement even though the maximum-likelihood decoder is very simple. In this correspondence, we present an enumeration scheme which encodes and decodes permutation codes with low complexity....
متن کاملVariable-length state splitting with applications to average runlength-constrained (ARC) codes
A new class of constrained systems: average runlength constraints (ARC) are defined. These systems are defined by requiring that the sum of n consecutive runlengths be bounded above by a linear function of IZ. In particular, the running average runlength of every sequence in the system is bounded above by a constant. A general result is given on the capacity of ARC systems. The state splitting ...
متن کاملBraun and Janssen: On the Low-Frequency Suppression Performance of DC-Free Runlength-Limited Modulation Codes ON THE LOW-FREQUENCY SUPPRESSION PERFORMANCE OF DC-FREE RUNLENGTH-LIMITED MODULATION CODES
Basic trade-offs between the rate of combined DC-free runlength-limited (DCRLL) modulation codes and the amount of suppression of low-frequency components are presented. The main results are obtained by means of a numerical study of dependencies between statistical properties of ideal, ‘maxentropic’ DCRLL sequences. The numerical results are mathematically founded by proving the observed behavi...
متن کاملConstruction of E cient Dc-Free Runlength-Limited Codes for Optical Recording
We will report on new dc-free runlength-limited codes (DCRLL) intended for the next generation of digital versatile disc (DVD). The e ciency of the newly developed DCRLL schemes is extremely close to the theoretical maximum, and as a result, signi cant density gains can be obtained with respect to prior art coding schemes. Preferred embodiments of the codes (footprints) and respective hardware ...
متن کاملAlmost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likelihoods that come out of the channel. I present two methods for creating transmissions that, with probability extremely close to 1, both are runlength-limited and are codewords of an outer linear error-correcting code (or ar...
متن کاملOn Error Propagation Assessment of High Rate Runlength-Limited Codes
A framework for the analysis of error propagation for high rate runlength-limited codes is developed. The susceptibility to errors of capacity approaching code constructions, the enumerative and sequence replacement technique and bit stuffing, are analyzed in detail. It is shown that the first two techniques experience low error propagation and that they are superior to the popular bit-stuffing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988